Solving Flexible Job Shop Scheduling with Multi Objective Approach

Authors

  • Arash Motaghedi-larijani A. Motaghedi-larijani, Author is with the Department of Industrial Engineering, Iran University of science & technology , Narmak, Tehran, Iran
Abstract:

  In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Pareto-optimal solutions in a reasonable run time. The algorithm utilizes from a local search heuristic for improving the chance of obtaining more number of global Pareto-optimal solutions. The solution method uses from a perturbed global criterion function for guiding the search direction of the hybrid algorithm. Computational experiences show that the hybrid algorithm has superior performance in contrast to previous studies .

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

full text

Multi-Objective Flexible Job Shop Scheduling Optimization Models (II)

For the Multi-Objective Flexible Job Shop Scheduling Problems (MOFJSSP), various optimization models have been designed. In the first part of the research (published in no. 2/2012) we presented the multi-sort production systems, the theoretical aspects of MOFJSSP framework, a specific real JSS process in drugs industry based on over 600 tasks to be optimally scheduled (used as a case study for ...

full text

Derleme Makalesi MULTI OBJECTIVE FLEXIBLE JOB SHOP SCHEDULING PROBLEMS

Flexible job shop scheduling problem, is an extension of the classical job shop scheduling problem. In Flexible job shop scheduling problem, there are more than one machine with the same features for the same purpose. The problem can be defined as appointing the jobs to the machines (assignment) and ordering the jobs at each machine (sequencing) to serve the desired purpose. Multi-objective fle...

full text

A Hybrid Multi Objective Algorithm for Flexible Job Shop Scheduling

Scheduling for the flexible job shop is very important in both fields of production management and combinatorial optimization. However, it quit difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. The combining of several optimization criteria induces additional complexity and new problems. In this paper, a...

full text

Multi-Objective Flexible Job Shop Scheduling Optimization Models (I)

In manufacturing area, the most difficult problems related to the time-efficiency frequently occur if the jobs to be scheduled are heterogeneous, if there are alternative routes on the machines for the jobs and multiple objectives are imposed. This framework, named Multi-Objective Flexible Job Shop Scheduling Problems (MOFJSSP), has been formalized, modeled and studied in the last decades from ...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 21  issue 4

pages  197- 209

publication date 2010-12

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023